for _ in range(int(input())):
n,s=int(input()),input()
c=s[n//2]
for i in range(n//2,n):
if s[i]!=c:
break
else:i=n
print(2*i-n)#include<bits/stdc++.h>
using namespace std;
int t;
int main(){
cin>>t;
while(t--){
int n;
string s;
cin>>n>>s;
int k = n/2, i = k, j=k;
while(s[i+1]==s[k] and i<n-1)
i++;
while(j>=1 and s[j-1]==s[k])
j--;
cout<<i-j+1<<"\n";
}
}
///
1614B - Divan and a New Project | 791A - Bear and Big Brother |
1452A - Robot Program | 344A - Magnets |
96A - Football | 702B - Powers of Two |
1036A - Function Height | 443A - Anton and Letters |
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |